By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 22, Issue 5, pp. 889-1116

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Finding a Smallest Augmentation to Biconnect a Graph

Tsan-Sheng Hsu and Vijaya Ramachandran

pp. 889-912

BibTeX  Abstract Full Text:  PDF

Different Modes of Communication

Bernd Halstenberg and Rüdiger Reischuk

pp. 913-934

BibTeX  Abstract Full Text:  PDF

Suffix Arrays: A New Method for On-Line String Searches

Udi Manber and Gene Myers

pp. 935-948

BibTeX  Abstract Full Text:  PDF

Randomizing Reductions of Search Problems

Andreas Blass and Yuri Gurevich

pp. 949-975

BibTeX  Abstract Full Text:  PDF

An Optimal Algorithm for the Maximum Three-Chain Problem

Ruey-Der Lou and Majid Sarrafzadeh

pp. 976-993

BibTeX  Abstract Full Text:  PDF

Random-Self-Reducibility of Complete Sets

Joan Feigenbaum and Lance Fortnow

pp. 994-1005

BibTeX  Abstract Full Text:  PDF

Learning Binary Relations and Total Orders

Sally A. Goldman, Ronald L. Rivest, and Robert E. Schapire

pp. 1006-1034

BibTeX  Abstract Full Text:  PDF

Drawing Graphs in the Plane with High Resolution

M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F. T. Leighton, A. Symvonis, E. Welzl, and G. Woeginger

pp. 1035-1052

BibTeX  Abstract Full Text:  PDF

Probabilistic Analysis of Disjoint Set Union Algorithms

Béla Bollobás and Istvan Simon

pp. 1053-1074

BibTeX  Abstract Full Text:  PDF

A Pseudorandom Oracle Characterization of ${\text{BPP}}$

Jack H. Lutz

pp. 1075-1086

BibTeX  Abstract Full Text:  PDF

Polynomial-Time Approximation Algorithms for the Ising Model

Mark Jerrum and Alistair Sinclair

pp. 1087-1116

BibTeX  Abstract Full Text:  PDF